Actions of the Braid Group, and New Algebraic Proofs of Results of Dehornoy and Larue
نویسندگان
چکیده
This article surveys many standard results about the braid group, with emphasis on simplifying the usual algebraic proofs. We use van der Waerden’s trick to illuminate the Artin-Magnus proof of the classic presentation of the braid group considered as the algebraic mapping-class group of a disc with punctures. We give a simple, new proof of the σ1-trichotomy for the braid group, and, hence, recover the Dehornoy right-ordering of the braid group. We give three proofs of the Birman-Hilden theorem concerning the fidelity of braid-group actions on free products of finite cyclic groups, and discuss the consequences derived by Perron-Vannier and the connections with Artin groups and the Wada representations. The first, very direct, proof, is due to Crisp-Paris and uses the σ1-trichotomy and the Larue-Shpilrain technique. The second proof arises by studying ends of free groups, and gives interesting extra information. The third proof arises from Larue’s study of polygonal curves in discs with punctures, and gives extremely detailed information. 2000Mathematics Subject Classification. Primary: 20F36; Secondary: 20F34, 20E05, 20F60.
منابع مشابه
Braid Order, Sets, and Knots
We survey two of the many aspects of the standard braid order, namely its set theoretical roots, and the known connections with knot theory, including results by Netsvetaev, Malyutin, and Ito, and very recent work in progress by Fromentin and Gebhardt. It has been known since 1992 [7, 8] that Artin’s braid groups Bn are leftorderable, by an ordering that has several remarkable properties. In pa...
متن کاملStrange Questions about Braids
The infinite braid group B∞ admits a left self-distributive structure. In particular, it includes a free monogenerated left self-distributive system, and, therefore, it inherits all properties of the latter object. Here we discuss how such algebraic properties translate into the language of braids. We state new results about braids and propose a list of open questions.
متن کاملBraids in trivial braid diagrams
We show that every trivial 3-strand braid diagram contains a disk, defined as a ribbon ending in opposed crossings. Under a convenient algebraic form, the result extends to every Artin–Tits group of dihedral type, but it fails to extend to braids with 4 strands and more. The proof uses a partition of the Cayley graph and a continuity argument.
متن کاملDisks in Trivial Braid Diagrams
We show that every trivial 3-strand braid diagram contains a disk, defined as a ribbon ending in opposed crossings. Under a convenient algebraic form, the result extends to every Artin–Tits group of dihedral type, but it fails to extend to braids with 4 strands and more. The proof uses a partition of the Cayley graph and a continuity argument.
متن کاملEvery Braid Admits a Short Sigma-definite Representative
A result by Dehornoy (1992) says that every nontrivial braid admits a σ-definite word representative, defined as a braid word in which the generator σi with maximal index i appears with exponents that are all positive, or all negative. This is the ground result for ordering braids. In this paper, we enhance this result and prove that every braid admits a σ-definite word representative that, in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Groups Complexity Cryptology
دوره 1 شماره
صفحات -
تاریخ انتشار 2009